Fast test zone search algorithm for interframe encoding
نویسندگان
چکیده
منابع مشابه
A Fast LSF Search Algorithm Based on Interframe Correlation in G.723.1
We explain a time complexity reduction algorithm that improves the line spectral frequencies (LSF) search procedure on the unit circle for low bit rate speech codecs. The algorithm is based on strong interframe correlation exhibited by LSFs. The fixed point C code of ITU-T Recommendation G.723.1, which uses the “real root algorithm” wasmodified and the results were verified on ARM7TDMI general ...
متن کاملFast Fibonacci Encoding Algorithm
Data compression has been widely applied in many data processing areas. Compression methods use variable-length codes with the shorter codes assigned to symbols or groups of symbols that appear in the data frequently. Fibonacci code, as a representative of these codes, is often utilized for the compression of small numbers. Time consumption of encoding as well as decoding algorithms is importan...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملFast Encoding Algorithm for Vector Quantization
In this paper, we present a new and fast encoding algorithm (FEA) for vector quantization. The magnitude (sum of the components of a vector) feature of the vectors is used in this algorithm to improve the efficiency of searching. Sorting of the magnitude values enhances the searching. As the values are sorted, the searching can be terminated in advance to reduce the time needed to locate the re...
متن کاملDynamic Window Search and Probability Dominated Algorithm for Fast Vector Quantization Encoding
Vector quantization (VQ), which has been widely applied in speech and image coding, provides an efficient technique for signal compression due to its excellent rate-distortion performance. However, it requires expensive encoding time to find the closest codeword to the input vector. This paper proposes a fast encoding method to speed up the closet codeword algorithm by accounting the occurrence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific and Technical Journal of Information Technologies, Mechanics and Optics
سال: 2017
ISSN: 2226-1494
DOI: 10.17586/2226-1494-2017-17-3-483-489